Problem:
 a(b(x)) -> b(a(x))
 a(c(x)) -> x

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {3}
   transitions:
    b1(8) -> 9*
    a1(10) -> 11*
    a1(7) -> 8*
    a0(2) -> 3*
    a0(1) -> 3*
    b0(2) -> 1*
    b0(1) -> 1*
    c0(2) -> 2*
    c0(1) -> 2*
    1 -> 8,3,10
    2 -> 8,3,7
    9 -> 11,8,3
    11 -> 8*
  problem:
   
  Qed